The spectral radius of edge chromatic critical graphs
نویسندگان
چکیده
منابع مشابه
Edge Chromatic 5-Critical Graphs
In this paper, we study the structure of 5-critical graphs in terms of their size. In particular, we have obtained bounds for the number of major vertices in several classes of 5-critical graphs, that are stronger than the existing bounds.
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملRemarks on the size of critical edge-chromatic graphs
We give new lower bounds for the size of A-critical edge-chromatic graphs when 6~<A ~<21. 1. I n t r o d u c t i o n All graphs we consider are undirected and have neither loops nor multiple edges. We denote the vertex set of a graph G by V(G) and the edge set by E(G). The order of G is I V(G)I and the size of G is IE(G)I. We denote the degree of a vertex v in G by de(v) and the maximum degree ...
متن کاملOn the independence number of edge chromatic critical graphs
In 1968, Vizing conjectured that for any edge chromatic critical graph G = (V,E) with maximum degree ∆ and independence number α(G), α(G) ≤ |V | 2 . It is known that α(G) < 3∆−2 5∆−2 |V |. In this paper we improve this bound when ∆ ≥ 4. Our precise result depends on the number n2 of 2-vertices in G, but in particular we prove that α(G) ≤ 3∆−3 5∆−3 |V | when ∆ ≥ 5 and n2 ≤ 2(∆− 1).
متن کاملChromatic number and spectral radius
Write (A) = 1 (A) min (A) for the eigenvalues of a Hermitian matrix A. Our main result is: let A be a Hermitian matrix partitioned into r r blocks so that all diagonal blocks are zero. Then for every real diagonal matrix B of the same size as A; (B A) B + 1 r 1 : Let G be a nonempty graph, (G) be its chromatic number, A be its adjacency matrix, and L be its Laplacian. The above inequality impli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2016
ISSN: 0024-3795
DOI: 10.1016/j.laa.2015.11.019